Approximate Solution of a Class of Queueing Networks with Breakdowns
نویسندگان
چکیده
In this paper we study a class of open queueing network where servers suffer breakdowns and are subsequently repaired. The network topology is a pipeline with feedback from the final node to the first. Each node consists of a number of queues each with an unreliable server. There are no losses from the queues in this system, however jobs are routed according to the distribution of operational servers at each node in the pipeline. This model is in general intractable, however an iterative technique is presented which combines a number of earlier results to generate an approximation to steady state measures found by simulation.
منابع مشابه
Queueing Networks with Blocking: Analysis, Solution Algorithms and Properties
Queueing network models with finite capacity queues and blocking are used for modeling and performance evaluation of systems with finite resources and population constraints, such as communication and computer systems, traffic, production and manufacturing systems. Various blocking types can be defined to represent different system behaviors, network protocols and technologies. Queueing network...
متن کاملPerformance Analysis of Queueing Networks with Blocking
Queueing network models have been widely applied for performance modeling and analysis of computer networks. Queueing network models with finite capacity queues and blocking (QNB) allow representing and analyzing systems with finite resources and population constraints. Different protocols can be defined to deal with finite capacity resources and they can be modeled in queueing networks with bl...
متن کاملApproximation in an M/G/1 queueing system with breakdowns and repairs
In this paper, we study the strong stability in the M/G/1 queueing system with breakdowns and repairs after perturbation of the breakdown’s parameter. Using the approximation conditions in the classical M/G/1 system, we obtain stability inequalities with exact computation of the constants. Thus, we can approximate the characteristics of the M/G/1 queueing system with breakdowns and repairs by t...
متن کاملFuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملApproximate Solution of Queueing Networks with Simultaneous Resource Possession
Queueing networks are important as Performance models of computer and communication systems because the performance of these systems is usually principally affected by contention for resources. Exact numerical solution of a queueing network is usually only feasible ifthe network has a product form solution in the sense of Jackson. An important network characteristic which apparently precludes a...
متن کامل